Computing the Fréchet distance between piecewise smooth curves
نویسنده
چکیده
We consider the Fréchet distance between two curves which are given as a sequence of m + n curved pieces. If these pieces are sufficiently wellbehaved, we can compute the Fréchet distance in O(mn log(mn)) time. The decision version of the problem can be solved in O(mn) time. The results are based on an analysis of the possible intersection patterns between circles and arcs of bounded curvature.
منابع مشابه
Simple Curve Embedding
Given a curve f and a surface S, how hard is it to find a simple curve f ′ ⊆ S that is the most similar to f? We introduce and study this simple curve embedding problem for piecewise linear curves and surfaces in R and R, under Hausdorff distance, weak Fréchet distance, and Fréchet distance as similarity measures for curves. Surprisingly, while several variants of the problem turn out to have p...
متن کاملOn Computing the Fréchet Distance Between Surfaces
We describe two (1 + ε)-approximation algorithms for computing the Fréchet distance between two homeomorphic piecewise linear surfaces R and S of genus zero and total complexity n, with Fréchet distance δ. 1. A 2 (( n+ Area(R)+Area(S) (εδ)2 )2) time algorithm if R and S are composed of fat triangles (triangles with angles larger than a constant). 2. An O(D/(εδ)2) · n + 2O(D/(εδ)) time algorithm...
متن کاملFréchet Distance for Curves, Revisited
We revisit the problem of computing the Fréchet distance between polygonal curves, focusing on the discrete Fréchet distance, where only distance between vertices is considered. We develop efficient approximation algorithms for two natural classes of curves: κ-bounded curves and backbone curves, the latter of which are widely used to model molecular structures. We also propose a pseudo–output-s...
متن کاملComputing Discrete Fréchet Distance
The Fréchet distance between two curves in a metric space is a measure of the similarity between the curves. We present a discrete variation of this measure. It provides good approximations of the continuous measure and can be efficiently computed using a simple algorithm. We also consider variants of discrete Fréchet distance, and find an interesting connection to measuring distance between th...
متن کاملApplied Similarity Problems Using Frechet Distance
The Fréchet distance is a well-known metric to measure similarity of polygonal curves. In the first part of this thesis, we introduce a new metric called Fréchet distance with speed limits and provide efficient algorithms for computing it. The classical Fréchet distance between two curves corresponds to the maximum distance between two point objects that traverse the curves with arbitrary non-n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 37 شماره
صفحات -
تاریخ انتشار 2007